Higher-order Aspects of Logic Programming
نویسنده
چکیده
Are higher-order extensions to logic programming needed? We answer this question in the negative by showing that higher-order features are already available in pure logic programming. It is demonstrated that higher-order lambda calculus-based languages can be compositionally embedded in logic programming languages preserving their semantics and abstraction facilities. Further, we show that such higherorder techniques correspond to programming techniques often practiced in logic programming.
منابع مشابه
A Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملThe Tblisi Symposium on Logic, Language and Computation Contents 1 Implementational Aspects of a Categorial Grammar Based on Partial Proof Trees 1 Implementational Aspects of a Categorial Grammar Based on Partial Proof Trees
abstract. We present some implementational aspects of a categorial system (PPTS) based on partial proof trees. A prototype version of this system has been implemented in Prolog, a higher-order logic programming language that allows for an elegant and declarative implementation of variable abstractions and-reduction at higher types. The operations of PPTS make extensive use of higher-order manip...
متن کاملObjects in a Higher-order Linear Logic Setting (extended Abstract)
In 5] some aspects of object-oriented programming have been reformulated in the higher-order Linear Logic framework, F&O, based on the language Forum 14]. In particular, it has been shown how to logically represent objects encapsulating method deenitions and how to describe metarules deening message passing and self-application, according to diierent computational models. A language based on su...
متن کاملA Confluent Relational Calculus for Higher-Order Programming with Constraints
We present the-calculus, a relational calculus parametrized with a logical constraint system. The-calculus provides for higher-order relational programming with rst-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform connuence of the-calculus. Uniform connu...
متن کاملAn Overview of Λprolog
λProlog is a logic programming language that extends Prolog by incorporating notions of higher-order functions, λ-terms, higher-order unification, polymorphic types, and mechanisms for building modules and secure abstract data types. These new features are provided in a principled fashion by extending the classical first-order theory of Horn clauses to the intuitionistic higher-order theory of ...
متن کامل